#include <stdio.h>
#include <stdlib.h>
typedef char ElemType;
typedef struct BiTNode
{
char data;
struct BiTNode* lchild, * rchild;
} BiTNode, * BiTree;
// 創建一棵二叉樹，約定用戶遵照前序遍歷的方式輸入資料
void CreateBiTree(BiTree* T)
{
char c;
scanf("%c", &c);
if (' ' == c)
{
*T = NULL;
}
else
{
*T = (BiTNode*)malloc(sizeof(BiTNode));
(*T)->data = c;
CreateBiTree(&(*T)->lchild);
CreateBiTree(&(*T)->rchild);
}
}
// 訪問二叉樹結點的具體操作，你想干嘛？！
void visit(char c, int level)
{
printf("%c 位于第 %d 層\n", c, level);
}
// 前序遍歷二叉樹
void PreOrderTraverse(BiTree T, int level)
{
if (T)
{
visit(T->data, level);
PreOrderTraverse(T->lchild, level + 1);
PreOrderTraverse(T->rchild, level + 1);
}
}
int main()
{
int level = 1;
BiTree T = NULL;
CreateBiTree(&T);
PreOrderTraverse(T, level);
return 0;
}
其中函式 CreateBiTree(BiTree* T) ，指標BiTree定義了指標T把我搞蒙了，大佬救救我
uj5u.com熱心網友回復：
就是二級指標啊uj5u.com熱心網友回復：
就等價于 CreateBiTree(BiTNode** T)uj5u.com熱心網友回復：
《牛肉干》C語言上機課，某女同學偷偷吃起牛肉干。
有一粒牛肉干掉到了鍵盤上，卡在7和8鍵之間。
女同學就在鍵盤上摳啊、摳啊、摳啊……
程式里一行代碼變成這個樣子：
int *pa=&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&*&a;
后來的結局是
————程式順利通過編譯，運行結果正確！
uj5u.com熱心網友回復：
請趙4老濕從語法（semantic）的角度解釋一下原理。
uj5u.com熱心網友回復：
補充一下，我就想知道，a是什么，& a 得到了什么，從而* & a 又是什么，最后& * & a 又得到了什么。請趙4老濕明示。^
uj5u.com熱心網友回復：
//C++ Operators
// Operators specify an evaluation to be performed on one of the following:
// One operand (unary operator)
// Two operands (binary operator)
// Three operands (ternary operator)
// The C++ language includes all C operators and adds several new operators.
// Table 1.1 lists the operators available in Microsoft C++.
// Operators follow a strict precedence which defines the evaluation order of
//expressions containing these operators. Operators associate with either the
//expression on their left or the expression on their right; this is called
//“associativity.” Operators in the same group have equal precedence and are
//evaluated left to right in an expression unless explicitly forced by a pair of
//parentheses, ( ).
// Table 1.1 shows the precedence and associativity of C++ operators
// (from highest to lowest precedence).
//
//Table 1.1 C++ Operator Precedence and Associativity
// The highest precedence level is at the top of the table.
//+------------------+-----------------------------------------+---------------+
//| Operator | Name or Meaning | Associativity |
//+------------------+-----------------------------------------+---------------+
//| :: | Scope resolution | None |
//| :: | Global | None |
//| [ ] | Array subscript | Left to right |
//| ( ) | Function call | Left to right |
//| ( ) | Conversion | None |
//| . | Member selection (object) | Left to right |
//| -> | Member selection (pointer) | Left to right |
//| ++ | Postfix increment | None |
//| -- | Postfix decrement | None |
//| new | Allocate object | None |
//| delete | Deallocate object | None |
//| delete[ ] | Deallocate object | None |
//| ++ | Prefix increment | None |
//| -- | Prefix decrement | None |
//| * | Dereference | None |
//| & | Address-of | None |
//| + | Unary plus | None |
//| - | Arithmetic negation (unary) | None |
//| ! | Logical NOT | None |
//| ~ | Bitwise complement | None |
//| sizeof | Size of object | None |
//| sizeof ( ) | Size of type | None |
//| typeid( ) | type name | None |
//| (type) | Type cast (conversion) | Right to left |
//| const_cast | Type cast (conversion) | None |
//| dynamic_cast | Type cast (conversion) | None |
//| reinterpret_cast | Type cast (conversion) | None |
//| static_cast | Type cast (conversion) | None |
//| .* | Apply pointer to class member (objects) | Left to right |
//| ->* | Dereference pointer to class member | Left to right |
//| * | Multiplication | Left to right |
//| / | Division | Left to right |
//| % | Remainder (modulus) | Left to right |
//| + | Addition | Left to right |
//| - | Subtraction | Left to right |
//| << | Left shift | Left to right |
//| >> | Right shift | Left to right |
//| < | Less than | Left to right |
//| > | Greater than | Left to right |
//| <= | Less than or equal to | Left to right |
//| >= | Greater than or equal to | Left to right |
//| == | Equality | Left to right |
//| != | Inequality | Left to right |
//| & | Bitwise AND | Left to right |
//| ^ | Bitwise exclusive OR | Left to right |
//| | | Bitwise OR | Left to right |
//| && | Logical AND | Left to right |
//| || | Logical OR | Left to right |
//| e1?e2:e3 | Conditional | Right to left |
//| = | Assignment | Right to left |
//| *= | Multiplication assignment | Right to left |
//| /= | Division assignment | Right to left |
//| %= | Modulus assignment | Right to left |
//| += | Addition assignment | Right to left |
//| -= | Subtraction assignment | Right to left |
//| <<= | Left-shift assignment | Right to left |
//| >>= | Right-shift assignment | Right to left |
//| &= | Bitwise AND assignment | Right to left |
//| |= | Bitwise inclusive OR assignment | Right to left |
//| ^= | Bitwise exclusive OR assignment | Right to left |
//| , | Comma | Left to right |
//+------------------+-----------------------------------------+---------------+
uj5u.com熱心網友回復：
答非所問。看來很多IT人士的語文水平都不行。
uj5u.com熱心網友回復：
自己眼拙看不到&和*的定義還怪別人答非所問。uj5u.com熱心網友回復：
我問的不是這些運算子有什么用，是什么。
uj5u.com熱心網友回復：
a前面的&和*們都是運算子你知道不？轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/280763.html
標籤：C語言
上一篇：鏈表問題