How to make a binary tree

i have this assignment for school. The first thing it says is: Write a binary tree class named my_Tree as the basic data structure. What does this mean? Can anyone give me an example of the java code that this should be written in?
Also, i have to sort a sequence of numbers in increasing order. I have the command line prompt written already, but how do i sort it using if/else statements? Thanks a lot. I'm really bad at java programming.

i dont really understand that? Im really slow at
this. Can you clarify?Sorry. Here is a more complete implementation of a node.
// header file for class Node
// copywrong filestream. no rights reserved
#ifndef _NODE_H_
#define _NODE_H_
class Node
   public:
      Node();
      Node(int x);
      Type getinfo();
      Node *getleft();
      Node *getright();
      void setinfo(Type x);
      void setleft(Node *n);
      void setright(Node *n);
   private:
      int info;
      Node *left;
      Node *right;
#endif

Similar Messages

How to make the APEX tree in the "Expand All" shape by default?

Could anybody please enlighten me on how to make the APEX tree in the "Expand All" shape by default please? I created an APEX tree and by default it's in the "Collapse All" shape. I am using APEX 4.1.0.00.21

Hi,
you can check the view source of html and check the onclick code written on that plus sign(Expand All), just copy that onclick javascript code and put it on page javascript event.
Thanks,
Jaydip Bosamiya
+91-76000 23053
http://jbosamiya.blogspot.com

How to make custom binary module and add to powershell?

How to make custom binary module and add to powershell?
I wish to add 'Microsoft.SharePoint.Client.dll' in powershell as binary module so I can use its intellisense.

Hi Biraj,
I replied to this in other thread
https://social.technet.microsoft.com/Forums/en-US/a13c9cc8-7d53-46b5-b5bb-65404db2d347/how-to-make-intellisense-enable-in-powershell-in-csom-for-sharepoint-online?forum=sharepointdevelopment
Kind Regards,
John Naguib
Senior Consultant
John Naguib Blog
John Naguib Twitter
Please remember to mark this as answered if it helped you

How to crossover this binary tree..?

You can view detail http://www.codeguru.com/forum/showthread.php?s=bb4cf7ad2b18a5115e8bd6ab3a4e9d17&t=470868
[nha khoa|http://www.sieuthi77.com/main/nhakhoa.html] .com/forum/showthread.php?s=bb4cf7ad2b18a5115e8bd6ab3a4e9d17&t=470868
I have these classes which model a tree (binary). the thing is i cant figure out how i can set the elements of individual nodes in that tree. i can get individual elements but i cannot set them due to the strucutre of the tree and how it is implemented. The changes that I make to these classes should be as less as possible, because i have an algorithm which generates the tree structure randomly, plus i can evaluate the tree easily by using recursion. The only left thing to do is CROSSOVER but how?!?
here are the classes which model my binary tree:
Code:
public abstract class Node implements Cloneable{
abstract double evaluate(VariableInput v);
abstract String print();
abstract int getNumberOfNodes();
abstract ArrayList<Object> getChildren();
@Override
public Node clone(){
Node copy;
try {
copy = (Node) super.clone();
} catch (CloneNotSupportedException unexpected) {
throw new AssertionError(unexpected);
//In an actual implementation of this pattern you might now change references to
//the expensive to produce parts from the copies that are held inside the prototype.
return copy;
Code:
public class UnaryNode extends Node {
private UnaryFunction operator;
private Node left;
public UnaryNode(UnaryFunction op, Node terminal) {
operator = op;
this.left = terminal;
public String print(){
String r = "(" + operator.toString()+ " " + left.print() + ")";
return r;
void setLeft(Node left) {
this.left = left;
@Override
int getNumberOfNodes() {
return 1 + left.getNumberOfNodes();
Node getLeft() {
return left;
ArrayList<Object> getChildren() {
ArrayList<Object> arr = new ArrayList<Object>();
arr.add(this);
arr.addAll(left.getChildren());
return arr;
Code:
public class BinaryNode extends Node {
private BinaryFunction operator;
private Node left;
private Node right;
public BinaryNode(BinaryFunction op, Node left, Node right) {
operator = op;
this.left = left;
this.right = right;
public String print(){
String r = "(" + operator.toString()+ " " + left.print() + " " + right.print()+")";
return r;
public void setLeft(Node left){
this.left = left;
public void setRight(Node right){
this.right = right;
@Override
int getNumberOfNodes() {
return 1 + left.getNumberOfNodes() + right.getNumberOfNodes();
Node getRight() {
return right;
Node getLeft() {
return left;
@Override
ArrayList<Object> getChildren() {
ArrayList<Object> arr = new ArrayList<Object>();
arr.add(this);
arr.addAll(left.getChildren());
arr.addAll(right.getChildren());
return arr;
public class NumericNode extends Node{
private double value;
public NumericNode(double v){
value = v;
@Override
double evaluate(VariableInput c) {
return value;
public String print(){
String r = "" + value;
return r;
@Override
int getNumberOfNodes() {
return 1;
@Override
ArrayList<Object> getChildren() {
ArrayList<Object> arr = new ArrayList<Object>();
arr.add(new NumericNode(value));
return arr;
}p.s. I have this get children method which return a list of REFERENCES to all the nodes in the tree, but if i change any of them it wont have an effect to the tree itself because they are references.
Any ideas or codes will be much appreciated. Thanks!

What? Changes to what a node is referencing will be reflected in the tree, unless your getChildren is returning a copy, like in NumericNode.
Kaj

How to serialize a binary tree object

HI Friends,
This is the problem.............................
I got a binary Tree Program with root (object ) containing the elements in the tree.
I got a server which performs insertions and deletions in the root.
Once it has got the operations right it has to send this object to client and Client will perform the search over this Binary Tree.
How to do this................................ Any Idea
Anyone can get me the Code....... It will be great to u....
reply me in this Id : [email protected]

Have you looked at the TreeSet code.
This is a collection which stores data as a binary tree. It is serializable, has a look at the readObject and writeObject methods.

How to make the navigation tree icon in an advanced datagrid to expand in different columns

Hi All ,
I am using an application built using Flex 3 .
In my application I am using an AdvancedDataGrid for datadisplay.
And the hierachy is like this
Tree structure in advanced datagrid at present :
Header 1
Header 2
Header 3
Header 4
Header 5
Parent Tree
   Expanded1
      Expanded2
          Expanded3
                 ParentTree
Expanded1
Expanded2
Expanded3
value
Expected tree structure in advanced datagrid :
Header 1
Header 2
Header 3
Header 4
Header 5
ParentTree
Expanded1
Expanded2
Expanded3
value
can someone tell me if this is possible in advanced data grid and if possible please let me know how do i expand the tree icons in seperate columns ...
Thanks ,
Ajantha

Hi,
you can check the view source of html and check the onclick code written on that plus sign(Expand All), just copy that onclick javascript code and put it on page javascript event.
Thanks,
Jaydip Bosamiya
+91-76000 23053
http://jbosamiya.blogspot.com

How to make the default tree row selection programatically

I have one use case where I am displaying the tree table based on some parameter which is just for filtering the table and display the part of hierarchy.
The problem here is I want to make a default selected row when the tree will be rendered to UI based on the primary key(that is the input parameter).
can you please tell me how to do this.I am using jdev 11g.
thanks,
Harsh

Hi,
for this you need to know where in the path the PK is. If e.g. the PK is for a second level node then you need to pass the first level node PK as well. Nodes in a tree are defined as ArrayLists. So unfortunately your question doesn't provide enough information
Frank

How to make a binary Startup-file

Please
I need help to create binary Start-up fil, that starts the java program. It's an desktop program for win system and athre Unix/Linux system.
Regards Micke

I was thinking if there is possible to executed thru the cmd in windows.
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
void exploit() {
printf("Test");
char *cmdline = "java HelloWorld";
execl(cmdline, "HelloWorld");
int main() {
exploit();
}

Emptying a Binary Tree

Hello,
The problem I'm having is how to empty a binary tree. Here is my code for MyBinaryTree:
public class MyBinaryTree implements BinaryTree {
   private BinaryTreeNode root;
   protected static int numNodes;
   private static String tree = "";
    * Constructor that creates a binary tree with a root.
    * @param r The root node
    * @param num The number of nodes
   public MyBinaryTree(BinaryTreeNode r, int num) {
      root = r;
      numNodes = num;
    * Method to make the binary tree empty.
   public void makeEmpty() {
      root.left = null;
      root.right = null;
      root = new BinaryTreeNode(null,null,null,null,null);
      numNodes = 0;
    * Method to make a root with key k and element el.
    * @param k The key of the root
    * @param el The element in the root
   public void makeRoot(Comparable k, Object el) {
      root = new BinaryTreeNode(k,el);
      numNodes++;
    * Method to return the root of the binary tree.
    * @return The root of the tree
   public BinaryTreeNode root() {
      return root;
    * Method to return the left child of a node.
    * @param node The node whose left child is wanted.
    * @return The left child of the node
    * @see NoNodeException
   public BinaryTreeNode leftChild(BinaryTreeNode node) throws NoNodeException {
      if (node.left == null) throw new NoNodeException("No left child!");
      else return node.leftChild();
    * Method to set the left child of node "node".
    * @param node The node to be given a left child
    * @param child The node to be set as left child
   public void setLeftChild(BinaryTreeNode node, BinaryTreeNode child) {
      node.setLeftChild(child);
      numNodes++;
    * Method to return the right child of a node.
    * @param node The node whose right child is wanted.
    * @return The right child of the node
    * @see NoNodeException
   public BinaryTreeNode rightChild(BinaryTreeNode node) throws NoNodeException{
      if (node.right == null) throw new NoNodeException("No right child!");
      else return node.rightChild();
    * Method to set the right child of node "node".
    * @param node The node to be given a right child
    * @param child The node to be set as right child
   public void setRightChild(BinaryTreeNode node, BinaryTreeNode child) {
      node.setRightChild(child);
      numNodes++;
    * Method to return the parent of a node.
    * @param node The node whose parent is wanted.
    * @return The parent of the node
    * @see NoNodeException
   public BinaryTreeNode parent(BinaryTreeNode node) throws NoNodeException {
      if (node.p == null) throw new NoNodeException("No parent!");
      else return node.parent();
    * Method to set the parent of node "node".
    * @param node The node to be given a parent
    * @param pt The node to be set as parent
   public void setparent(BinaryTreeNode node, BinaryTreeNode pt) {
      node.setParent(pt);
      numNodes++;
    * Method to return the key of the specified node.
    * @param node The node with the key to be returned
    * @return The key of the node
   public Comparable getKey(BinaryTreeNode node) {
      return node.getKey();
    * Method to set the key of the specified node.
    * @param node The node for which the key will be set.
    * @param k The key to be set.
   public void setKey(BinaryTreeNode node, Comparable k) {
      node.setKey(k);
    * Method to get the element in the specified node.
    * @param node The node with the element to be returned.
    * @return The element in the node.
   public Object getElement(BinaryTreeNode node) {
      return node.getElement();
    * Method to put an element into the specified node.
    * @param node The node that will have an element put in it.
    * @param o The element to be inserted.
   public void setElement(BinaryTreeNode node, Object o) {
      node.setElement(o);
    * Method to add a left child to the specified node.
    * @param theNode The node that the left child will be added to.
    * @param k The key associated with the left child.
    * @param el The element in the left child.
   public void addLeftChild (BinaryTreeNode theNode, Comparable k, Object el) {
      BinaryTreeNode temp = new BinaryTreeNode(k,el);
      temp.setParent(theNode);
      theNode.setLeftChild(temp);
      numNodes++;
    * Method to add a right child to the specified node.
    * @param theNode The node that the right child will be added to.
    * @param k The key associated with the right child.
    * @param el The element in the right child.
   public void addRightChild (BinaryTreeNode theNode, Comparable k, Object el) {
      BinaryTreeNode temp = new BinaryTreeNode(k,el);
      temp.setParent(theNode);
      theNode.setRightChild(temp);
      numNodes++;
    * Method to remove the left child of the specified node.
    * @param theNode The node which the left child will be removed.
   public void removeLeftChild(BinaryTreeNode theNode) {
      ((BinaryTreeNode)(theNode.left)).p = null;
      theNode.left = null;
      numNodes--;
    * Method to remove the right child of the specified node.
    * @param theNode The node which the right child will be removed.
   public void removeRightChild(BinaryTreeNode theNode) {
      ((BinaryTreeNode)(theNode.right)).p = null;
      theNode.right = null;
      numNodes--;
    * Private method to perform an inorder traversal on the tree.
    * @param t A MyBinaryTree object
    * @param n The starting node.
   private static String inorderPrint(MyBinaryTree t, BinaryTreeNode n) {
      String spaces = "";
      for (int i = 0; i < (numNodes - 1)/2; i++) spaces += " ";
      if (n.left != null || n.right != null) inorderPrint(t,t.leftChild(n));
      tree += spaces + n.getElement();
      if (n.left != null || n.right != null) inorderPrint(t,t.rightChild(n));
      return tree;
    * Private method to perform an inorder traversal on the tree.
    * @param t A MyBinaryTree object
    * @param n The starting node.
    * @param pos The current position in the tree.
    * @return A tree with an asterix beside the current position
   private static String inorderPrint2(MyBinaryTree t, BinaryTreeNode n,
                                       BinaryTreeNode pos) {
      String spaces = "";
      for (int i = 0; i < (numNodes - 1)/2; i++) spaces += " ";
      if (n.left != null || n.right != null) inorderPrint2(t,t.leftChild(n),pos);
      if (n.getElement() == pos.getElement()) tree += spaces + n.getElement() + "*";
      else tree += spaces + n.getElement();
      if (n.left != null || n.right != null) inorderPrint2(t,t.rightChild(n),pos);
      return tree;
    * Method to return a String representation of the binary tree.
    * @return String representation of the binary tree
   public String toString() {
      if (root.getElement() == null) return "*** Tree is empty ***";
      else {
         MyBinaryTree temp = new MyBinaryTree(root,numNodes);
         return inorderPrint(temp,root);
    * Method to return a String of the binary tree with an asterix beside the
    * current position.
    * @param currentPosition The current position.
    * @return A String of the tree with an asterix by the current position
   public String toString(BinaryTreeNode currentPosition) {
      if (root.getElement() == null) return "*** Tree is empty ***";
      else {
         MyBinaryTree temp = new MyBinaryTree(root,numNodes);
         return inorderPrint2(temp,root,currentPosition);
}Those are all the methods I'm allowed to have. When I run makeEmpty, it seems to work, but then if I do makeRoot, the old tree prints again. It's quite bizarre. Any tips on how to empty the tree correctly?

Here is the BinaryTreeNode code.
public class BinaryTreeNode {
    // Instance variables (Note: they are all "private")
    protected Comparable key;           // The key at this node
    protected Object element;          // The data at this node
    protected BinaryTreeNode left;     // Left child
    protected BinaryTreeNode right;    // Right child
    protected BinaryTreeNode p;        // The Parent
    // Constructors
    BinaryTreeNode( Comparable theKey, Object theElement, BinaryTreeNode lt,
                    BinaryTreeNode rt, BinaryTreeNode pt ) {
        key      = theKey;
        element = theElement;
        left     = lt;
        right    = rt;
        p        = pt;
    BinaryTreeNode( Comparable theKey, Object theElement) {
        key      = theKey;
        element = theElement;
        left     = null;
        right    = null;
        p        = null;
    // return the key attached to this node
    public Comparable getKey() {
        return key;
    // set the key attached to this node to be Comparable k
    public void setKey(Comparable k) {
        key = k;
    // return the element attached to this node
    public Object getElement() {
        return element;
    // set the element attached to this node to be Object o
    public void setElement(Object o) {
        element = o;
    // return left child
    public BinaryTreeNode leftChild() {
        return left;
    // set left child to be node n
    public void setLeftChild(BinaryTreeNode n) {
        left = n;
    // return right child
    public BinaryTreeNode rightChild() {
        return right;
    // set right child to be node n
    public void setRightChild(BinaryTreeNode n) {
        right = n;
    // return parent
    public BinaryTreeNode parent() {
        return p;
    // set parent to be node n
    public void setParent(BinaryTreeNode n) {
        p = n;
}

Problem with binary tree please help

i am trying to make a binary tree but the problem is that when i print the data only the last value is printed i think i am moving my root. but dont know how to solve it please help me.
public void insert(String n)
//          (void)
          if (root == null)
               System.out.println("Root is null");
               TreeNode temp = new TreeNode(n);
               System.out.println("\n\n\n\n"+temp.name+"\n\n\n\n\n");
               root = rootTemp = temp;
          else
               System.out.println("Root is not null" +rootTemp.name);
               insert(rootTemp, n);
     private TreeNode insert(TreeNode v, String n) {
          if (v == null)
               return new TreeNode(n);
          else
               if (n.compareTo(v.name) < 0)
                    v.left = insert(v.left, n);
               else
                    v.right = insert(v.right, n);
               return v;
     }

Are you sure the problem is not in the printing code?
I can't see any obvious mistakes after a quick look... But if "root" is a reference to the root node, what is "rootTemp"?

A Binary Tree Implementation in ABAP

Hi,
Can any one explaine me how to create a binary tree of random numbers with dynamic objects.
Thanks,
Manjula.

Hi manjula,
This sample code uses dynamic objects to create a binary tree of random numbers as per your requirement ...pls go through It.
It stores numbers on the left node or right node depending on the value comparison with the current value. There are two recursive subrotines used for the building of the tree and printing through the tree.
For comparison purpose, the same random numbers are stored and sorted in an internal table and printed.
*& Report YBINTREE - Build/Print Binary Tree of numbers *
report ybintree .
types: begin of stree,
value type i,
left type ref to data,
right type ref to data,
end of stree.
data: tree type stree.
data: int type i.
data: begin of rnd occurs 0,
num type i,
end of rnd.
start-of-selection.
do 100 times.
generate random number between 0 and 100
call function 'RANDOM_I4'
exporting
rnd_min = 0
rnd_max = 100
importing
rnd_value = int.
store numbers
rnd-num = int.
append rnd.
build binary tree of random numbers
perform add_value using tree int.
enddo.
stored numbers are sorted for comparison
sort rnd by num.
print sorted random numbers
write: / 'Sorted Numbers'.
write: / '=============='.
skip.
loop at rnd.
write: rnd-num.
endloop.
skip.
print binary tree. This should give the same result
as the one listed from the internal table
write: / 'Binary Tree List'.
write: / '================'.
skip.
perform print_value using tree.
skip.
*& Form add_value
text - Build tree with value provided
-->TREE text
-->VAL text
form add_value using tree type stree val type i.
field-symbols: <ltree> type any.
data: work type stree.
if tree is initial. "When node has no values
tree-value = val. " assign value
clear: tree-left, tree-right.
create data tree-left type stree. "Create an empty node for left
create data tree-right type stree. "create an empty node for right
else.
if val le tree-value. "if number is less than or equal
assign tree-left->* to <ltree>. "assign the left node to fs
call add_value recursively with left node
perform add_value using <ltree> val.
else. "if number is greater
assign tree-right->* to <ltree>. "assign the right node to fs
call add_value recursively with right node
perform add_value using <ltree> val.
endif.
endif.
endform. "add_value
*& Form print_value
text - traverse tree from left-mid-right order
automatically this will be sorted list
-->TREE text
form print_value using tree type stree.
field-symbols: <ltree> type any.
if tree is initial. "node is empty
else. "non-empty node
assign tree-left->* to <ltree>. "left node
perform print_value using <ltree>. "print left
write: tree-value. "print the current value
assign tree-right->* to <ltree>. "right node
perform print_value using <ltree>. "print right
endif.
endform. "print_value
pls reward if helps,
regards.

How to extend breadth first Search for Binary Tree to any kind of Tree??

Dear Friends,
I am thinking a problem, How to extend breadth first Search for Binary Tree to any kind of Tree?? ie each node has more than 2 leaves such as 1, 2,3,4 or any,
I have following code to successfully apply for breadth first Search in Binary Tree as follows,
package a.border;
import java.util.ArrayList;
import java.util.LinkedList;
public class Tree
    int root;
    Tree left;
    Tree right;
    static ArrayList<Integer> list = new ArrayList<Integer>();
    static ArrayList<Tree> treeList = new ArrayList<Tree>();
    private static LinkedList<Tree> queue = new LinkedList<Tree>();
     * @param root root value
     * @param left left node
     * @param right right node
    public Tree(int root, Tree left, Tree right)
        this.root = root;
        this.left = left;
        this.right = right;
    /** Creates a new instance of Tree
     * You really should know what this does...
     * @param root
    public Tree(int root)
        this.root = root;
        this.left = null;
        this.right = null;
     * Simply runs a basic left then right traversal.
    public void basicTraversal()
        //Check if we can go left
        if (left != null)
            left.basicTraversal();
        //Add the root
        list.add(root);
        //Check if we can go right
        if (right != null)
            right.basicTraversal();
    public ArrayList<Integer> getBreadthTraversal(ArrayList<Integer> list)
        //Add the root to the arraylist, we know it is always the first entry.
        list.add(root);
        //Basically we add the first set of nodes into the queue for
        //traversing.
        //Query if left exists
        if (left != null)
            //Then add the node into the tree for traversing later
            queue.add(left);
        //Same for right
        if (right != null)
            queue.add(right);
        //Then we call the traverse method to do the rest of the work
        return traverse(list);
    private ArrayList<Integer> traverse(ArrayList<Integer> list)
        //Keep traversing until we run out of people
        while (!queue.isEmpty())
            Tree p = queue.remove();
            //Check if it has any subnodes
            if (p.left != null)
                //Add the subnode to the back of the queue
                queue.add(p.left);
            //Same for left
            if (p.right != null)
                //Same here, no queue jumping!
                queue.add(p.right);
            //Append to the ArrayList
            list.add(p.root);
        //And return
        return list;
     * Makes a tree and runs some operations
     * @param args
    public static void main(String[] args)
         *                             4
         *          t =           2       6
         *                      1   3    5   7
        Tree leaf6 = new Tree(1);
        Tree leaf7 = new Tree(3);
        Tree leaf8 = new Tree(5);
        Tree leaf9 = new Tree(7);
        Tree t4 = new Tree(2, leaf6, leaf7);
        Tree t5 = new Tree(6, leaf8, leaf9);
        Tree t = new Tree(4, t4, t5);
        t.basicTraversal();
        System.out.println("Here is basicTraversal ="+list.toString());
        list.clear();
        t.getBreadthTraversal(list);
        System.out.println("getBreadthTraversal= " +list.toString());
        list.clear();
    }Can Guru help how to update to any kind of tree??
here this code is for the tree like:
         *                             4
         *          t =           2       6
         *                      1   3    5   7
         */But i hope the new code can handle tree like:
         *                             4
         *                           /   | \
         *                          /     |   \
         *          t =            2     8   6
         *                        / | \    |    /| \
         *                      1 11 3 9   5 10 7
         */Thanks

sunnymanman wrote:
Dear Friends,
I am thinking a problem, How to extend breadth first Search for Binary Tree to any kind of Tree?? ...The answer is interfaces.
What do all trees have in common? And what do all nodes in trees have in common?
At least these things:
interface Tree<T> {
    Node<T> getRoot();
interface Node<T> {
    T getData();
    List<Node<T>> getChildren();
}Now write concrete classes implementing these interfaces. Let's start with a binary tree (nodes should have comparable items) and an n-tree:
class BinaryTree<T extends Comparable<T>> implements Tree<T> {
    protected BTNode<T> root;
    public Node<T> getRoot() {
        return root;
class BTNode<T> implements Node<T> {
    private T data;
    private Node<T> left, right;
    public List<Node<T>> getChildren() {
        List<Node<T>> children = new ArrayList<Node<T>>();
        children.add(left);
        children.add(right);
        return children;
    public T getData() {
        return data;
class NTree<T> implements Tree<T> {
    private NTNode<T> root;
    public Node<T> getRoot() {
        return root;
class NTNode<T> implements Node<T> {
    private T data;
    private List<Node<T>> children;
    public List<Node<T>> getChildren() {
        return children;
    public T getData() {
        return data;
}Now with these classes, you can wite a more generic traversal class. Of course, every traversal class (breath first, depth first) will also have something in common: they return a "path" of nodes (if the 'goal' node/data is found). So, you can write an interface like this:
interface Traverser<T> {
    List<Node<T>> traverse(T goal, Tree<T> tree);
}And finally write an implementation for it:
class BreathFirst<T> implements Traverser<T> {
    public List<Node<T>> traverse(T goal, Tree<T> tree) {
        Node<T> start = tree.getRoot();
        List<Node<T>> children = start.getChildren();
        // your algorithm here
        return null; // return your traversal
}... which can be used to traverse any tree! Here's a small demo of how to use it:
public class Test {
    public static void main(String[] args) {
        Tree<Integer> binTree = new BinaryTree<Integer>();
        // populate your binTree
        Tree<Integer> nTree = new NTree<Integer>();
        // populate your nTree
        Traverser<Integer> bfTraverser = new BreathFirst<Integer>();
        // Look for integer 6 in binTree
        System.out.println("bTree bfTraversal -> "+bfTraverser.traverse(6, binTree));
        // Look for integer 6 in nTree
        System.out.println("bTree bfTraversal -> "+bfTraverser.traverse(6, nTree));
}Good luck!

How can I make a palm tree sway?

How can I make a palm tree sway?
I have a palm tree that is a tiff file with alpha. I would like the tree trunk to bend a little and a few of the branches to sway as though it’s gently moving in the wind.
What would be the easiest way to make that happen?
Should I save the trunk and a few leaves as separate elements, and then animate them in motion.
Or is there any way to turn my palm tree into a shape in motion, add edit points and key frames to animate it?
Any advice would be appreciated.
Thanks

Down and dirty: highlight the tree's layer, move the anchor point to the base of the tree, add an Oscillate Behaviour to its Shear X axis. Adjust the Amplitude to 5, Speed to 7 or so, depending on how breezy the day is.

How to make fields editable in an alv tree

hi
there is an alv grid for which tree view shud also be made. The cells that are editable in the grid should also be editable in the tree.
please let me know how to make the specific cells of the tree editable

after setting the edit field in the field catalogue its bot working.
i am posting the code snippet.
please let me know what else should be done and how to add INPUT field to the fieldcat.
field-symbols: <fs_fieldcat> type lvc_s_fcat.
data: l_tabix type sy-tabix.
data: g_fieldcatalog type lvc_t_fcat,
        wa_fcat like line of g_fieldcatalog.
data : hide type c value 'X'.
call function 'LVC_FIELDCATALOG_MERGE'
    EXPORTING
      i_structure_name       = 'RSTHIE_M'
      i_client_never_display = 'X'
      i_bypassing_buffer     = 'X'
    CHANGING
      ct_fieldcat            = g_fieldcatalog.
***-set table header on middle width
LOOP AT g_fieldcatalog ASSIGNING <fs_fieldcat>.
    <fs_fieldcat>-FIX_COLUMN = 'X'.
    <fs_fieldcat>-edit = 'X'.
ENDLOOP.

How to make field editable in ALV tree in OOPs?

Hi Gems,
Again I need help from you all.
I am writing a program using OOPs and the uotput will be in ALV tree. I need to make a field editable in a perticular row.
I am doing it using layout but the program is giving error during
CALL METHOD CL_GUI_CFW=>FLUSH
      EXCEPTIONS
        CNTL_SYSTEM_ERROR = 1
        CNTL_ERROR        = 2.
This method is returning sy-subrc = 2 and I am unable to get the output.
I am using below code to make the field editable:
DATA: LT_LAYOUT_ITEM TYPE LVC_T_LAYI,
            LS_LAYOUT_ITEM TYPE LVC_S_LAYI.
LS_LAYOUT_ITEM-FIELDNAME = 'ACPCKTWRT'.     "ACPCKTWRT is the field name in the Internal table
LS_LAYOUT_ITEM-EDITABLE = 'X'.
APPEND LS_LAYOUT_ITEM TO LT_LAYOUT_ITEM.
CALL METHOD G_ALV_TREE->ADD_NODE
    EXPORTING
      I_RELAT_NODE_KEY     = FP_RELAT_KEY
      I_RELATIONSHIP       = CL_GUI_COLUMN_TREE=>RELAT_LAST_CHILD
      IS_OUTTAB_LINE       = LS_TMP_FINFCNO                                                "structure of the internal table
     IS_NODE_LAYOUT       =
      IT_ITEM_LAYOUT       = LT_LAYOUT_ITEM                                                "Added layout to make the field editable
      I_NODE_TEXT          = LV_NODE_TEXT                                                      "Node text
    IMPORTING
      E_NEW_NODE_KEY       = FP_NODE_KEY
    EXCEPTIONS
      RELAT_NODE_NOT_FOUND = 1
      NODE_NOT_FOUND       = 2
      OTHERS               = 3
IF SY-SUBRC <> 0.
    MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
               WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
ENDIF.
Please help me and let me know how to get the solution.

Hello
The ALV tree control is not intended for making values editable (e.g. see
[How to make ALV tree columns editable|http://sap.ittoolbox.com/groups/technical-functional/sap-abap/how-to-make-alv-tree-columns-editable-2052414])
However, if you need an editable tree control then you have to use a different class (e.g. CL_ITEM_TREE_MODEL or CL_COLUMN_TREE_MODEL) but you will not have the ALV functionality of the ALV tree control.
Regards
Uwe

How to make a binary tree

Similar Messages

Maybe you are looking for