Package adt.tree

Examples of adt.tree.TreeNode

33
34
35
36
37
38
39
40
41
42
43
44
45
import adt.tree.TreeNode;

public class Q073B_Print_all_nodes_at_distance_k_from_a_given_node {

  public static void main(String[] args) {
    TreeNode root = Tree.tree15();
   
    // step 1. find the node
    TreeNode node = findNode(root, 3);
    //System.out.println(node.val);
       
    kDistFromNode(root, node, 2);
  }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
   
    if (root.val == v) {
      return root;
    }
   
    TreeNode left = findNode(root.left, v);
    TreeNode right = findNode(root.right, v);
   
    return (left != null) ? left : right;
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
import adt.tree.TreeNode;

public class Q011_Count_leaf_nodes_in_a_binary_tree {

  public static void main(String[] args) {
    TreeNode root = Tree.bst2();
    int res = getLeafCount(root);
    System.out.println(res);
  }
View Full Code Here
51
52
53
54
55
56
57
58
59
import adt.tree.TreeNode;

public class Q046_Check_whether_a_given_Binary_Tree_is_Complete_or_not {

  public static void main(String[] args) {
    TreeNode root = Tree.bst1();
    boolean res = isCompleteTree(root);
    System.out.println(res);
  }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
    curr.add(root);
   
    boolean must_have_no_child = false;
   
    while (!curr.isEmpty()) {
      TreeNode node = curr.poll();
     
      if (must_have_no_child) {
        if (node.left != null || node.right != null) {
          return false;
        }
View Full Code Here
69
70
71
72
73
74
75
76
77
78
import adt.tree.TreeNode;

public class Q015_Convert_an_arbitrary_Binary_Tree_to_a_tree_that_holds_Children_Sum_Property {

  public static void main(String[] args) {
    TreeNode root = Tree.tree3();
    convertTree(root);
   
    root.print();
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
import adt.tree.TreeNode;

public class Q077_Inorder_predecessor_and_successor_for_a_given_key_in_BST {

  public static void main(String[] args) {
    TreeNode root = Tree.bst2();
    int key = 14;
   
    int floor = getFloor(root, key);
    int ceil = getCeil(root, key);
    System.out.format("%d, %d\n", floor, ceil);
View Full Code Here
36
37
38
39
40
41
42
43
44
import adt.tree.TreeNode;

public class Q036_Convert_a_given_tree_to_its_Sum_Tree {

  public static void main(String[] args) {
    TreeNode root = Tree.tree5();
    toSumTree(root);
    root.print();
  }
View Full Code Here
59
60
61
62
63
64
65
66
67
import adt.tree.TreeNode;

public class Q066_Remove_all_nodes_which_donot_lie_in_any_path_with_sum_larger_than_or_equal_to_k {

  public static void main(String[] args) {
    TreeNode root = Tree.tree10();
    root = prune(root, 45, 0);
    root.print();
  }
View Full Code Here
34
35
36
37
38
39
40
41
42
import adt.tree.TreeNode;

public class Q053_Largest_Independent_Set_Problem {
 
  public static void main(String[] args) {
    TreeNode root = Tree.tree8();
    int res = LISS(root);
    System.out.println(res);
  }
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.