Package adt.tree

Examples of adt.tree.TreeNode

29
30
31
32
33
34
35
36
37
import adt.tree.TreeNode;

public class Q054_Find_if_there_is_a_triplet_in_a_Balanced_BST_that_adds_to_zero {

  public static void main(String[] args) {
    TreeNode root = Tree.tree9();
    boolean res = isTripletPresent(root);
    System.out.println(res);
  }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
import adt.tree.TreeNode;

public class Q022_Maximum_width_of_a_binary_tree {

  public static void main(String[] args) {
    TreeNode root = Tree.tree1();
    int width = getTreeWidth(root);
    System.out.println(width);
   
    int max = getMaxWidth(root);
    System.out.println(max);
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
   
    int count = 0;
    int width = 0;
   
    while (!curr.isEmpty()) {
      TreeNode node = curr.poll();
      count++;
     
      if (node.left != null) {
        next.add(node.left);
      }
View Full Code Here
33
34
35
36
37
38
39
40
41
import adt.tree.TreeNode;

public class Q061_Difference_between_sums_of_odd_level_and_even_level_nodes_of_a_Binary_Tree {

  public static void main(String[] args) {
    TreeNode root = Tree.tree1();
    int diff = getLevelDiff(root);
    System.out.println(diff);
  }
View Full Code Here
38
39
40
41
42
43
44
45
46
     *               /  \
     *             65    80
     *            / \
     *           90  17
     */
    TreeNode root = Tree.tree6();
    findDepth(root, 1);
    System.out.println(max);
  }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
import adt.tree.TreeNode;

public class Q001_Tree_Traversals {
 
  public static void main(String[] args) {
    TreeNode root = Tree.tree1();
   
    System.out.format("Preorder\n");
    preorder(root);
    System.out.format("\n");
    preorderR(root);
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
  //
  //  1 2 4 5 3 6 7
  // -------------------------
  static void preorder(TreeNode root) {
    Stack<TreeNode> stack = new Stack<TreeNode>();
    TreeNode curr = root;
   
    while (!stack.isEmpty() || curr != null) {
      if (curr != null) {
        System.out.format("%d ", curr.val);
        stack.push(curr);
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
  //
  //  4 2 5 1 6 3 7
  // -------------------------
  static void inorder(TreeNode root) {
    Stack<TreeNode> stack = new Stack<TreeNode>();
    TreeNode curr = root;
   
    while (!stack.isEmpty() || curr != null) {
      if (curr != null) {
        stack.push(curr);
        curr = curr.left;
View Full Code Here
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
    Stack<TreeNode> out_stack = new Stack<TreeNode>();
   
    in_stack.push(root);
   
    while (!in_stack.isEmpty()) {
      TreeNode node = in_stack.pop();
      out_stack.push(node);
     
      if (node.left != null) {
        in_stack.push(node.left);
      }
     
      if (node.right != null) {
        in_stack.push(node.right);
      }
    }
   
    while (!out_stack.isEmpty()) {
      TreeNode node = out_stack.pop();
      System.out.format("%d ", node.val);
    }
  }
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
   
    Queue<TreeNode> queue = new LinkedList<TreeNode>();
    queue.add(root);
   
    while (!queue.isEmpty()) {
      TreeNode node = queue.poll();
      System.out.format("%d ", node.val);
     
      if (node.left != null) {
        queue.add(node.left);
      }
View Full Code Here
TOP

Related Classes of adt.tree.TreeNode

  • adt.tree.Tree
  • problems.geeks.linkedlist.Q026A_Sorted_Linked_List_to_Balanced_BST
  • problems.geeks.linkedlist.Q026B_Sorted_Linked_List_to_Balanced_BST
  • problems.geeks.tree.Q001_Tree_Traversals
  • problems.geeks.tree.Q002_Calculate_Size_of_a_tree
  • problems.geeks.tree.Q003_Determine_if_Two_Trees_are_Identical
  • problems.geeks.tree.Q004_Find_the_Maximum_Depth_or_Height_of_a_Tree
  • problems.geeks.tree.Q005_Delete_a_Tree
  • problems.geeks.tree.Q006_Convert_a_Binary_Tree_into_its_Mirror_Tree
  • problems.geeks.tree.Q007_Print_out_all_of_its_root_to_leaf_paths_one_per_line
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.