binary-tree-preorder-traversal 1.0.0
Binary Tree Preorder Traversal
Loading...
Searching...
No Matches
TreeNode Struct Reference

Definition for a binary tree node. More...

Collaboration diagram for TreeNode:

Public Member Functions

 TreeNode ()
 
 TreeNode (int x)
 
 TreeNode (int x, TreeNode *left, TreeNode *right)
 

Data Fields

int val
 
TreeNodeleft
 
TreeNoderight
 

Detailed Description

Definition for a binary tree node.

Definition at line 11 of file main.cpp.

Constructor & Destructor Documentation

◆ TreeNode() [1/3]

TreeNode::TreeNode ( )
inline

Definition at line 16 of file main.cpp.

16: val(0), left(nullptr), right(nullptr) {}
int val
Definition main.cpp:13
TreeNode * left
Definition main.cpp:14
TreeNode * right
Definition main.cpp:15

◆ TreeNode() [2/3]

TreeNode::TreeNode ( int  x)
inline

Definition at line 17 of file main.cpp.

17: val(x), left(nullptr), right(nullptr) {}

◆ TreeNode() [3/3]

TreeNode::TreeNode ( int  x,
TreeNode left,
TreeNode right 
)
inline

Definition at line 18 of file main.cpp.

18: val(x), left(left), right(right) {}

Field Documentation

◆ left

TreeNode* TreeNode::left

Definition at line 14 of file main.cpp.

Referenced by delete_tree(), Solution::preorderTraversal(), and Solution::set_value().

◆ right

TreeNode* TreeNode::right

Definition at line 15 of file main.cpp.

Referenced by delete_tree(), Solution::preorderTraversal(), and Solution::set_value().

◆ val

int TreeNode::val

Definition at line 13 of file main.cpp.

Referenced by Solution::preorderTraversal(), and Solution::set_value().


The documentation for this struct was generated from the following file: