leetcode::TreeNode结构体 参考

#include <leetcode.h>

Public 成员函数
	TreeNode ()
	TreeNode (int x)
	TreeNode (int x, TreeNode *left, TreeNode *right)
bool	operator!= (const TreeNode &) const
bool	operator== (const TreeNode &) const

Public 属性
TreeNode *	left
TreeNode *	right
int	val

详细描述

在文件 leetcode.h 第 23 行定义.

构造及析构函数说明

TreeNode() [1/3]

leetcode::TreeNode::TreeNode ( )

inline

在文件 leetcode.h 第 28 行定义.

            : val(0), left(nullptr), right(nullptr) {}

TreeNode() [2/3]

leetcode::TreeNode::TreeNode ( int  x )

inlineexplicit

在文件 leetcode.h 第 31 行定义.

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

TreeNode() [3/3]

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

inline

在文件 leetcode.h 第 34 行定义.

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

成员函数说明

operator!=()

bool leetcode::TreeNode::operator!=

(

const TreeNode &

node

)

const

在文件 leetcode.cpp 第 41 行定义.

{ return !(*this == node); }

operator==()

bool leetcode::TreeNode::operator==

(

const TreeNode &

node

)

const

在文件 leetcode.cpp 第 19 行定义.

                                                        {
        if(this->left != nullptr && node.left == nullptr) {
            return false;
        }
        if(this->left == nullptr && node.left != nullptr) {
            return false;
        }
        if(this->right != nullptr && node.right == nullptr) {
            return false;
        }
        if(this->right == nullptr && node.right != nullptr) {
            return false;
        }
        if(this->left != nullptr && node.left != nullptr && *this->left != *node.left) {
            return false;
        }
        if(this->right != nullptr && node.right != nullptr && *this->right != *node.right) {
            return false;
        }
        return this->val == node.val;
    }

引用了 left, right , 以及 val.

类成员变量说明

left

TreeNode* leetcode::TreeNode::left

在文件 leetcode.h 第 25 行定义.

被这些函数引用 leetcode::convert_bst_to_greater_tree::Solution::copy(), leetcode::lowest_common_ancestor_of_a_binary_search_tree::Solution::copy(), leetcode::delete_node_in_a_bst::Solution::deleteNode(), leetcode::house_robber_iii::Solution::dfs(), leetcode::all_nodes_distance_k_in_binary_tree::Solution::distanceK(), leetcode::subtree_of_another_tree::Solution::equal(), leetcode::delete_node_in_a_bst::equal(), leetcode::delete_node_in_a_bst::Solution::findMinimum(), leetcode::find_all_the_lonely_nodes::Solution::getLonelyNodes(), operator==(), leetcode::delete_node_in_a_bst::Solution::remove() , 以及 leetcode::serialize_and_deserialize_binary_tree::Codec::serialize().

right

TreeNode* leetcode::TreeNode::right

在文件 leetcode.h 第 26 行定义.

被这些函数引用 leetcode::convert_bst_to_greater_tree::Solution::copy(), leetcode::lowest_common_ancestor_of_a_binary_search_tree::Solution::copy(), leetcode::delete_node_in_a_bst::Solution::deleteNode(), leetcode::house_robber_iii::Solution::dfs(), leetcode::all_nodes_distance_k_in_binary_tree::Solution::distanceK(), leetcode::subtree_of_another_tree::Solution::equal(), leetcode::delete_node_in_a_bst::equal(), leetcode::delete_node_in_a_bst::Solution::findMaximum(), leetcode::find_all_the_lonely_nodes::Solution::getLonelyNodes(), operator==(), leetcode::delete_node_in_a_bst::Solution::remove() , 以及 leetcode::serialize_and_deserialize_binary_tree::Codec::serialize().

val

int leetcode::TreeNode::val

在文件 leetcode.h 第 24 行定义.

被这些函数引用 leetcode::convert_bst_to_greater_tree::Solution::convert(), leetcode::convert_bst_to_greater_tree::Solution::copy(), leetcode::lowest_common_ancestor_of_a_binary_search_tree::Solution::copy(), leetcode::delete_node_in_a_bst::Solution::deleteNode(), leetcode::house_robber_iii::Solution::dfs(), leetcode::all_nodes_distance_k_in_binary_tree::Solution::distanceK(), leetcode::subtree_of_another_tree::Solution::equal(), leetcode::delete_node_in_a_bst::equal(), leetcode::find_all_the_lonely_nodes::Solution::getLonelyNodes(), leetcode::lowest_common_ancestor_of_a_binary_search_tree::Solution::lowestCommonAncestor(), operator==(), leetcode::delete_node_in_a_bst::Solution::remove(), leetcode::serialize_and_deserialize_binary_tree::Codec::serialize() , 以及 leetcode::lowest_common_ancestor_of_a_binary_search_tree::TEST().

---

该结构体的文档由以下文件生成:

• leetcode.h
• leetcode.cpp